A Dynamic K Value Method of Massive Data Reduction Based on Improved LLE Algorithm
نویسنده
چکیده
For more features massive data sets efficiently reduction problems, to enhance the data uniformity of the near target instance, reduce the errors of represented neighbors, improve the effect of dimension reduction, proposed a dynamic K value method of massive data reduction based on improved LLE algorithm. Utilized the search algorithms based center point, searched an example neighborly, to ensure the neighbor instances which were distributed around the instance maximally and uniformly; to guarantee the change of K value accorded with the characteristics of the non-uniform data sets, put forward the method to adjust the K value dynamically according to the local uniformity changes of data sets, designed the changing rules of K value to meet the need of algorithm dimensionality reduction for the non-uniform data sets. The experimental results shown, utilized this improved method to carry out dimensionality reduction and classification for the non-uniform data sets in this thesis, and has certain advantages compared with other methods.
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملImproved COA with Chaotic Initialization and Intelligent Migration for Data Clustering
A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...
متن کاملImproved Locally Linear Embedding by Using Adaptive Neighborhood Selection Techniques
Unsupervised learning algorithm locally linear embedding (LLE) is a typical technique which applies the preserving embedding method of high dimensional data to low dimension. The number of neighborhood nodes of LLE is a decisive parameter because the improper value will affect the manifold structure in the local neighborhood and lead to the lower computational efficiency. Based on the fact that...
متن کاملA More Topologically Stable Locally Linear Embedding Algorithm Based on R*-Tree
Locally linear embedding is a popular manifold learning algorithm for nonlinear dimensionality reduction. However, the success of LLE depends greatly on an input parameter neighborhood size, and it is still an open problem how to find the optimal value for it. This paper focuses on this parameter, proposes that it should be self-tuning according to local density not a uniform value for all the ...
متن کاملFault Diagnosis Method Based on a New Supervised Locally Linear Embedding Algorithm for Rolling Bearing
In view of the complexity and nonlinearity of rolling bearings, this paper presents a new supervised locally linear embedding method (R-NSLLE) for feature extraction. In general, traditional LLE can capture the local structure of a rolling bearing. However it may lead to limited effectiveness if data is sparse or non-uniformly distributed. Moreover, like other manifold learning algorithms, the ...
متن کامل